On the Transitive Domination Principle for Continuous Function-Kernels
نویسندگان
چکیده
منابع مشابه
Kernels in quasi-transitive digraphs
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs
متن کاملK-kernels in K-transitive and K-quasi-transitive Digraphs
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent (if u, v ∈ N then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) − N then there exists v ∈ N such that d(u, v) ≤ l) set of vertices. A k-kernel is a (k, k − 1)-kernel. A digraph D is transitive if (u, v), (v, w) ∈ A(D) implies that (u,w) ∈ A(D). This co...
متن کاملDomination and Information Boundedness Principle for Aggregation
The information boundedness principle for rule based inference process requires that the knowledge obtained as a result of a rule should not have more information than that contained in the consequent of this rule. We formulate the information boundedness principle for aggregation and show that it can be expressed using the notion of dominance. We also investigate conditions under which this pr...
متن کاملDomination in transitive colorings of tournaments
An edge coloring of a tournament T with colors 1, 2, . . . , k is called ktransitive if the digraph T (i) defined by the edges of color i is transitively oriented for each 1 ≤ i ≤ k. We explore a conjecture of the first author: For each positive integer k there exists a (least) p(k) such that every k-transitive tournament has a dominating set of at most p(k) vertices. We show how this conjectur...
متن کاملEfficient domination in cubic vertex-transitive graphs
An independent set of vertices S of a graph dominates the graph efficiently if every vertex of the graph is either in S or has precisely one neighbour in S. In this paper we prove that a connected cubic vertex-transitive graph on a power of 2 vertices has a set that dominates it efficiently if and only if it is not isomorphic to a Möbius ladder. This is a preprint of an article accepted for pub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nagoya Mathematical Journal
سال: 1975
ISSN: 0027-7630,2152-6842
DOI: 10.1017/s0027763000016524